Real-time group communication is an indispensable part of many interactive multimedia applications over the\r\ninternet. In scenarios that involve large group sizes, sporadic sources, high user churns, and random network\r\nfailures, gossip-based protocols can potentially provide advantages over structure-based group communication\r\nalgorithms in ease of deployment, scalability, and resiliency against churns and failures. In this paper, we propose\r\na novel protocol called Redundancy Reduced Gossip for real-time N-to-N group communication. We show that\r\nour proposed protocol can achieve a considerably lower traffic load than conventional push-based gossip\r\nprotocols and conventional push-pull gossip protocols for the same probability of successful delivery, with higher\r\nperformance gains in networks with smaller delays. We derive a mathematical model for estimating the frame nondelivery\r\nprobability and the traffic load from overhead, and demonstrate the general correctness of the model by\r\nsimulation. We implement a functioning prototype conferencing system using the proposed protocol, completed\r\nwith functions including NTP synchronization, dynamic group size estimation, redundancy suppression, and other\r\nfeatures needed for proper operation. We perform experiments over the campus network and PlanetLab, and\r\nthe prototype system demonstrates the ability of our protocol to maintain robust performance in real-world\r\nnetwork environments.
Loading....